- reachability analysis
- анализ достижимости, осуществимости (целей, поставленных в ТЗ на разработку системы)анализ достижимости состояний (метод верификации конечных автоматов)
Англо-русский словарь промышленной и научной лексики. 2014.
reachability analysis
Смотреть что такое "reachability analysis" в других словарях:
Construction and Analysis of Distributed Processes — Developer(s) the INRIA VASY team Initial release 1986, 24–25 years ago Stable release … Wikipedia
Cluster analysis — The result of a cluster analysis shown as the coloring of the squares into three clusters. Cluster analysis or clustering is the task of assigning a set of objects into groups (called clusters) so that the objects in the same cluster are more… … Wikipedia
Uclid — (pronounced IPA|/ˈjuklɪd/, the same as Euclid ) is a decision procedure for CLU logic and can be used as a tool for bounded model checking of infinite state systems.Decision Procedure and Verification ToolUCLID is a tool for verifying models of… … Wikipedia
Reduced Binary Circuits — Reduced Binary Circuit stellen eine Möglichkeit dar, digitale Schaltkreise mit wenig Overhead kompakt zu repräsentieren. Resultat ist ein gerichteter azyklischer Graph G bestehend aus Knoten und Kanten. Interne Knoten repräsentieren einen binären … Deutsch Wikipedia
Tree automaton — A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of… … Wikipedia
Rabbit Model Checker — Rabbit is a model checking tool for real time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides reachability analysis and refinement checking, both implemented using the data… … Wikipedia
Petri net — A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, in which the nodes represent transitions (i.e.… … Wikipedia
Garbage collection (computer science) — This article is about garbage collection in memory management. For garbage collection in an SSD, see garbage collection (SSD). For other uses, see garbage collection. In computer science, garbage collection (GC) is a form of automatic memory… … Wikipedia
Border Gateway Protocol — BGP redirects here. For the Formula One Team, see Brawn GP. The Border Gateway Protocol (BGP) is the protocol backing the core routing decisions on the Internet. It maintains a table of IP networks or prefixes which designate network reachability … Wikipedia
OPTICS algorithm — OPTICS ( Ordering Points To Identify the Clustering Structure ) is an algorithm for finding density based clusters in spatial data. It was presented by Mihael Ankerst, Markus M. Breunig, Hans Peter Kriegel and Jörg Sander[1]. Its basic idea is… … Wikipedia
Control flow graph — Simplified control flowgraphs[1] A control flow graph (CFG) in computer science is a representation, using graph notation, of all paths that might be traversed through a program during its execution … Wikipedia
